Moore bound for mixed networks
نویسندگان
چکیده
منابع مشابه
A revised Moore bound for mixed graphs
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focussed on finding new examples of graphs or families of graph with orders approaching the bound as closely as possible. There has been recent interest ...
متن کاملA Moore-like bound for mixed abelian Cayley graphs
We give an upper bound for the number of vertices in mixed abelian Cayley graphs with given degree and diameter.
متن کاملThe Moore Bound for Irregular Graphs
What is the largest number of edges in a graph of order n and girth g? For dregular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to cover irregular graphs as well, yielding an affirmative answer to an old open problem ([4] p.163, problem 10). What is the maximal number of edges in a graph with n vertices and girth g? Put differently, wha...
متن کاملA Moore Bound for Simplicial Complexes
Let X be a d-dimensional simplicial complex with N faces of dimension d− 1. Suppose that every (d−1)-face of X is contained in at least k ≥ d+2 faces of X of dimension d. Extending the classical Moore bound for graphs, it is shown that X must contain a ball B of radius at most dlogk−d Ne whose d-dimensional homology Hd(B) is non-zero. The Ramanujan Complexes constructed by Lubotzky, Samuels and...
متن کاملThe Moore bound for Spectral Radius
Let G be a graph with n vertices, m edges, girth g, and spectral radius μ. Then
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2008
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.09.059